Secure information retrieval and update

ABSTRACT

A secure storage module of a client device interacts with a set of secure storage servers to securely store data items of the client on the servers, such that no individual server has the data in readable (non-obfuscated) form. Additionally, the client secure storage module and the servers interact to allow the client device to read a given portion of the original data items from the servers, such that none of the servers can determine which portion of the original data is being requested. Similarly, the interactions of the client secure storage module and the servers allows the client device to update a given portion of the original data on the servers to a new value, such that none of the servers can determine which portion is being updated and that none of the servers can determine either the prior value or new value or the difference between the new value and the prior value.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 16/683,780, filed Nov. 14, 2019, which is a continuation of U.S. patent application Ser. No. 15/456,436, filed Mar. 10, 2017, the entire contents of each of which are incorporated by reference herein.

TECHNICAL FIELD

The disclosed embodiments relate generally to computer communications and, more specifically, to providing secure access to confidential information stored within a server cloud.

BACKGROUND

Users often communicate with each other over the Internet, and store network-based data, in an unsecure manner. Unsecure communications and data are acceptable for many purposes where the information communicated is of a non-sensitive nature.

However, there are many contexts in which the information communicated is actually or potentially sensitive, such as when communicating and storing confidential business details, conducting e-commerce, and the like. In such contexts, the communicating users should employ systems with cryptographic capabilities that can encrypt and decrypt the communicated information. This prevents intermediate parties such as active eavesdroppers, systems such as routers that make up the Internet architecture, and the systems storing data at remote locations, from being able to obtain the communicated information in its original plaintext form.

The cryptographic infrastructure needed to allow users to easily and transparently secure their communications can be complex. Delegation of cryptographic functionality entails a certain degree of trust of the infrastructure components that provide the functionality. Accordingly, a third-party organization providing the cryptographic functionality may be able to exploit this trust to obtain the original, unencrypted communications. Such a risk may not be acceptable to some users, e.g., when conducting highly sensitive communications.

More specifically, although information is communicated and stored in encrypted form, the mere fact of selecting among several encrypted items in a database may reveal sensitive information. The request which expresses such a selection must therefore be encrypted, as well. While this protects against eavesdroppers on the network, the request itself cannot easily be hidden from the server responding to the query or update request: Human operators of the cloud infrastructure could, for example, gain access to the server's internal memory where the request is decrypted and represented in unencrypted form, and/or to the new content that is to be stored in encrypted form in the cloud.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a system environment in which secure communications takes place, according to one embodiment.

FIGS. 2A and 2B respectively illustrate components of the client secure storage modules and of the secure storage servers, according to one embodiment.

FIGS. 3A-3D illustrate the interactions between a client device and the various secure storage servers as part of the various operations described above with respect to the modules of FIG. 2B.

FIG. 4 is a flow chart illustrating operations involved in distributing and updating a data item and reading the updated data item, according to one embodiment.

FIG. 5 is a high-level block diagram illustrating physical components of a computer used as part or all of the communication server, organization system, or client device from FIG. 1, according to one embodiment.

The figures depict various embodiments of the present invention for purposes of illustration only. One skilled in the art will readily recognize from the following description that other alternative embodiments of the structures and methods illustrated herein may be employed without departing from the principles of the invention described herein.

DETAILED DESCRIPTION

FIG. 1 shows a system environment in which secure storage and secure communication take place, according to one embodiment. Users of an organization that wishes to use secure cloud-based (server-based) storage use services of a secure communications infrastructure. The items of data to be securely stored may include (for example) computer source code, confidential business information, trade secrets, images, and/or any other type of client data items for which user privacy and security are desired. The secure communications infrastructure is implemented by the interactions of a secure storage module 124 installed on client devices 120 and a set of secure storage servers 101. The interactions of the secure storage module 124 of a client device 120 and the secure storage servers 101, and the distribution of portions of client data across a server cloud of the various servers 101, permit the client device to store its items of data (e.g., as stored in a file containing any type of data) across the servers 101 such that no individual server 101 can determine the original client data being stored. Further, due to the way in which query information is distributed across the servers 101, the client device 120 can read individual portions of the data items—each portion being distributed across the multiple servers 101—without any of the servers 101 being able to determine which portion is being read. Still further, the client device 120 can update individual portions of the data items without any of the servers being able to determine which portion is being updated, or even to be able to determine what new value is being written to the portion being updated. (These distribution, read, and update operations that do not disclose information to servers, eavesdroppers, or the like can be referred to collectively as privacy-preserving data operations.) The update operations can also be achieved with a single set of parallel request-response operations between the client device 120 and the servers 101, rather than requiring multiple rounds of requests and responses. The privacy-preserving data operations are information theoretically secure, rather than merely computationally secure, in that those with access to the individual servers, eavesdroppers, or others attempting to obtain the information lack sufficient information to do so, and thus cannot break the system, even with unlimited computing power, assuming that the original data is properly encrypted so that it cannot be read while in transport.

The client devices 120 and the secure storage servers 101 communicate with each other through a network 140. The network may be any suitable communications network for data transmission. In one embodiment, the network 140 is the Internet and uses standard communications technologies and/or protocols.

It should be understood that although for simplicity FIG. 1 depicts only two client devices 120 for the multiple secure storage servers 101, there may be any number of client devices and secure storage servers. It should also be understood that the client device 120 may be any computer system (also referred to as a “source computer”) that is a source of data to be securely stored and updated and that uses the servers 101 to facilitate the privacy-preserving data operations.

FIGS. 2A and 2B respectively illustrate components of the secure storage modules 124 of the client devices 120 and of the secure storage servers 101, according to one embodiment. Together, the secure storage modules 124 and the secure storage servers 101 implement secure storage functionality that allows users of client devices 120 to store, read, and update data items (also referred to simply as “data”) stored on the servers 101 such that the stores, reads, and updates do not reveal information to the servers 101 or to eavesdroppers or other parties on the network 140. (The term “securely access” is used hereinafter to denote performing a secure data operation such as storing, reading, or updating of the data items that is privacy-preserving and keeps data confidential at all times.)

In brief, the secure storage module 124 divides the data across the different, non-colluding secure storage servers 101, combining the different portions of the divided data with random values in such a manner that the divided and obfuscated portions of the divided data can also be read and updated separately on the various servers 101, without the client device 120 needing to obtain the original data in its entirety. This provides greater efficiency relative to operating on the data as a whole, both with respect to computation and with respect to network data transfer, in that only subsets of the data need be transformed and transmitted. The nature of the data distribution and transformation techniques permit the client device to derive the data in its original form, given the various transformed portions of the divided data stored by the various servers 101. Only a single “round-trip” (set of parallel requests from a client device 120 to the set of secure storage servers 101, and reply from the set of secure storage servers 101 to the client device) is required for a read of a particular data portion, and only a single round-trip is needed for a secure update (see FIG. 3C) if a client device already knows the value of the data portion to be updated (which it can achieve with a read). The distribution of the data across multiple servers 101 also prevents any given server (or eavesdropper on the server's network) from obtaining information such as which portion of the data is being read or updated.

The secure storage servers 101 form a non-colluding server cloud. The servers 101 are designed not to communicate with each other to combine the divided data, which could result in obtaining the original unencrypted data. Additionally, to further lessen the danger of collusion, the various secure storage servers 101 can be operated by different organizations, so that an employee of one organization gaining access to the data in one of the secure storage servers would not allow access to data in other secure storage servers.

The secure storage module 124 comprises a secure distribution module 205 that securely distributes data of the client device 120 to the secure storage servers 101 in an obfuscated manner such that none of the servers 101 has the ability to infer the original value of the data, and such that the client devices can read and update portions of the data in an efficient manner. For purposes of explanation, the data of a client device 120 is hereinafter denoted C (denoting “content”), and the i^(th) secure storage server is denoted S_(i). Content C may be processed in sub-portions. In the embodiment described hereafter, C is processed in L-bit sub-portions (hereinafter denoted “rows”), and to this purpose is represented as an [N×L] matrix of N rows and L columns (that is, L bits per row), with reads and updates being performed on L-bit rows. Any amount of client data C may be processed; if a row of C is not a multiple of L bits, it may be padded to a multiple of L bits before being processed. In some embodiments, N and L need not be the same for all items of data being securely stored (e.g., files), but rather are adjustable parameters that may vary for each data item.

The secure distribution module 205 distributes the data of C across K secure storage servers 101 (2 k=K>=4), with obfuscation, so that no single secure storage server 101 has the entire data of C in original (non-obfuscated) form.

Specifically, in one embodiment, the set of servers 101 is split in two groups of equal size k, where k>=2. The secure distribution module 205 sends, to each of the k servers (denoted with index j) in each of the two groups (denoted with index i), an obfuscated portion of the bits of C, the obfuscated portion denoted R_(ij), and having the same size as C itself (i.e., N×L bits). To achieve this, R_(1j) is initialized to random bits (i.e., a randomly-selected 0 or 1 bit, for each of the (N×L) bits), and R_(2j) is initialized to a copy of R_(1j). (Accordingly, by virtue of the XOR operation, the sum of R_(1j) and R_(2j) is the zero matrix.) For a fixed j, for j in 1 . . . k, each bit of C is added to R_(xj) (that is, either to R_(1j) or to R_(2j), randomly selected). Put differently, for each bit of C, the bit is imprinted on R—that is, XOR'ed with the bit at the corresponding position of the selected R, and the result is stored at that position in that R. Imprinting all bits of C to a single R for a given j, or spreading them randomly over both Rs with the same j, are both permissible alternatives employed in different embodiments. The secure distribution module 205 sends R_(ij) to all the servers 101 of the corresponding group i, such that each of the servers receives exactly one of the portions. The servers 101 store the portions R_(ij) in an obfuscated portion repository 255, e.g., implemented as a database. (The term “obfuscated portion” is used for R_(ij) in that each R_(ij) is expected to reflect a portion of the data of C, and the random values to which the portion was initialized provide obfuscation.)

In another embodiment, in order to reduce the risk of collusion attacks, more than two server groups are used. Specifically, the set of servers 101 is split in g groups of size k, where g>=2 and k>=2. The g*k servers receive an obfuscated portion of the bits of C, the obfuscated portion denoted R_(ij), and having the same size as C itself (i.e., N×L bits). For a fixed j, j in 1 . . . k, and for i in 1 . . . g−1, matrices R_(ij) are independently initialized to random bits, and the remaining one of the R_(ij) is initialized to the sum (bitwise XOR) of the other g−1 matrices R_(ij). (Accordingly, by virtue of the XOR operation, the sum all R_(ij) for a fixed j is the zero matrix.) For a fixed j, for j in 1 . . . k, each bit of C is added to R_(xj) (where x is randomly chosen within the range 1 . . . g). Put differently, for each bit of C, the bit is imprinted on R—that is, XOR'ed with the bit at the corresponding position of the selected R, and the result is stored at that position in that R. Imprinting all bits of C to a single R for a given j, or spreading them randomly over all Rs with the same j, are both permissible alternatives employed in different embodiments.

In one embodiment, in order to prevent eavesdroppers on the network 140 from obtaining all the R_(ij) (with the same j) and reassembling C based on them, an encryption module 225 of the client secure storage module 124 encrypts the portions before transmitting them to the secure storage servers 101. In order to achieve the appropriate isolation of the different secure storage servers 101, from each other, the R_(ij) are encrypted differently for the different servers, such as using different cryptographic keys (e.g., different client-server pairs for symmetric key solution such as Kerberos, or a distinct public key per server for asymmetric key systems such as RSA, DSA, or elliptic curve systems, or distinct session keys using a transport layer-based protocol such as SSL). In some embodiments, the client secure storage module 124 sends a randomly-generated key along with each request (e.g., a read request for a data portion) sent to one of the secure storage servers 101, and the servers 101 use the respective randomly-generated key to encrypt the value (e.g., the data portion being read) that it sends back to the client device. The secure storage module 124 additionally comprises a secure read module 210 that obtains the original data of a specified row of C from the set of secure storage servers 101, such that none of the servers can determine which row is being obtained. Thus, not only do the servers 101 not know the actually data bits of the row being obtained (i.e., the data itself), but they additionally don't know which row is being obtained (i.e., the location of the data within C).

Specifically, for each read request, the secure read module 210 initializes k−1 random vectors r_(j)(j=1 . . . k−1), each having N random bits (i.e., each of the N bits is a 0 or 1 selected at random, N being the number of rows of C). Additionally, a vector r_(k) is set to the bitwise sum (XOR) of the k−1 random vectors; accordingly, the bitwise sum of all k vectors r_(j) (j=1 . . . k) is the zero vector.

The secure read module 210 encodes in k query vectors q_(j) the index (denoted b) of the desired row. In one embodiment, in order to perform the encoding, the secure read module 210 randomly selects one of the k vectors r_(j) and encodes b within that selected r_(j). To do so, the vector e_(b) is formed, e_(b) being an all-zero vector of N bits, except for a bit set in the position of the vector corresponding to b (e.g., if b is 1, corresponding to the first row, e_(b) has a 1 in the first element, and a 0 in the remaining N−1 elements). (It is appreciated that, in general, the choice of 0 or 1 as representing set/unset is not significant; equally, 1 could represent unset, and 0 could represent set.) To encode the desired row in the selected q_(j), e_(b) is bitwise added (XOR'ed) to the corresponding r_(j). All other query vectors q_(j) are simply a copy of the respective r_(j). In other embodiments, e_(b) may be added to any odd number of r_(j)s, rather than to only a single r_(j); due to the nature of bitwise XOR, the result will be the same as if e_(b) had been added to a single r_(j), in that every pair of e_(b) additions will cancel each other out.

The secure read module 210 sends each q_(j) to the j_(th) of the k servers 101 of group i, such that each server of this group receives exactly one of the vectors q_(j). In one embodiment, the secure read module 210 performs encryption on the vectors q_(j) before sending them to the servers 101, so as to prevent eavesdroppers from obtaining all the q_(j) and bitwise adding them to obtain b, as represented by e_(b).

Upon receiving the vector q_(j) as part of the request for the row data, a query vector application module 260 of the corresponding secure storage server S_(ij) 101 _(ij) of server group i computes a query result component a_(ij), the product of the obfuscated portion R_(ij) stored by S_(ij) and the query vector q_(j): When computing the matrix-vector product R_(ij) q_(ij), if the m^(th) element of q_(ij) is set, row m from R_(ij) is selected, and all selected rows are summed up using XOR, resulting in the partial query result vector a_(ij) with L bits:

a _(ij)=Σ_(m)(q _(ijm)*row_(m)(R _(i)))=q _(ij) ^(T) *R _(ij) (matrix-vector product)

The query vector application module 260 sends the computed partial query result vectors a_(ij) back to the client secure read module 210. In one embodiment, in order to prevent eavesdroppers on the network 140 from obtaining all the a_(ij) (of a group i) and reassembling the retrieved row based on them, the secure storage server S_(ij) 101 _(ij) encrypts the result component a_(ij) before transmitting it to the client secure storage 124. If SSL transport was used for the query, the encryption of SSL itself may be used for this purpose; alternatively, if the client device 120 provided the secure storage servers 101 with different randomly-generated keys, the servers 101 may use those keys when providing a_(ij) back to the client device.

The client secure read module 210 accordingly obtains the a_(ij) for each server S_(ij). For a fixed j in the range 1 . . . k, the secure read module 210 computes a_(ij)=Σ_(i) a_(ij), the bitwise sum (XOR) of all the received a_(ij) for this j. Due to way in which the various R_(ij) were computed, transformed, and distributed so as to securely represent C, the result of a=Σ a_(j), which is computed by the secure read module 210, is the value of row b. Note that:

a _(j)=Σ_(i) a _(ij)=Σ_(i) R _(ij) *q _(j) =q _(j) ^(T)*Σ_(j) R _(i) =q _(j) ^(T) *C and therefore

a=Σ _(j) a _(j)=Σ_(j) q _(j) ^(T) *C=e _(b) ^(T) *C=row_(b)(C)

That is, the original value of C is obtained from the combination of the obfuscated R_(ij), and because the query vectors q_(i) were selected to sum to e_(b), e_(b) can be used to select the desired row from the original data, C.

The client secure storage module 124 further comprises a secure update module 215 that allows a client device 120 to update a portion of the data C, as stored by the secure storage servers 101, to a new value, while preventing any of the servers 101 from determining which portion is being updated. Specifically, the secure update module 215 sets the value of a particular row of C with index b to a given value (i.e., set of L bits) while concealing the value of b from the servers 101.

In order to request the servers 101 on which C is securely stored to update the row b to a new value (set of bits) w, the secure update module 215 uses the secure read module 210 to obtain the current value (denoted v) of the row b as collectively securely stored by the servers 101.

The secure update module 215 computes an update delta value u as the bitwise sum (XOR) of the current value v and the desired value w (i.e., u=v+w).

The secure update module 215 then sends different update messages <t,u> to the two (or more, if thus configured) groups of servers. That is, the secure update module 215 initializes a vector r of N random bits (N being the number of rows in C). For each group i of k servers 101, the secure update module 215 generates a “randomized component” t_(i), which is set either to the random vector r, or to the combination of r with the row ID vector e_(b) (e.g., the bitwise sum of r and e_(b)). Specifically, t_(i)=r+e_(b) for one of the groups, and t_(i)=r for the other groups; the group for which t_(i)=r+e_(b) is selected at random. For each of the groups, the secure update module 215 sends an update message m_(i)=<t_(i), u> to each of that group's k servers. The value t_(i) (either r, or r+e_(b)) is referred to as a “randomized component”. Thus, e_(b) is not provided in original form, but rather as transformed by a random vector t_(i), so the individual servers receiving the update messages cannot determine e_(b) from t_(i).

In one embodiment, in order to reduce the risk of collusion attacks, more than one group is sent the randomized component t=r+e_(b), provided that the number of these groups is odd and the total number of groups is even. In case of the system having only two groups, exactly one group must receive a message containing t=r+e_(b), as was explained above.

Upon receiving the messages m=<t_(i),u> as part of the request to update the row b to value w, the secure storage servers 101 collectively replace the current value v in row b with the value w. To effect this replacement, a transformation module 565 of each of the secure storage servers 101 uses an outer product of the received update message t and update value u to imprint a server-specific mask on the obfuscated portion R_(ij) already stored by the server, such that operation of the secure read module 220 will return the correct update value, w.

That is, the transformation module 565 computes and stores, instead of its current obfuscated portion R_(ij), a transformation (denoted R_(ij)′) of R_(ij) that factors in the values t_(i) and u (the bitwise sum of v and w) received as part of the update message for group i. Specifically, the transformation module 265 computes the outer product of t_(i) and u, which serves as a mask used to transform the stored obfuscated portion R_(ij). The transformation module bitwise adds (XOR) the mask to R_(ij). That is, R_(ij)′=R_(ij)+(t_(i)⊗u). The outer product is a [N×L] matrix U that is constructed by inserting a row at position m with value u each time the m_(th) element of t_(i) is set, or inserting a row of zeros otherwise. The transformation module 565 then saves R_(ij)′ in place of R_(ij). (Note that the use of the various vectors t_(i) prevents the identity of the row being transformed from being known to any of the individual servers 101, yet the identity of the row contributes to the transformation effected by at least one of the t_(i)s which then goes into the outer products (t_(i)⊗u)).

Due to the design of the update transformations, when the client secure storage module requests the value of row b from the servers 101 via the secure read module 210, after the securely stored row b is updated by the secure updated module 215 to the value w, it will correctly receive w. Recall that retrieving a row from the system involves the construction of query vectors q_(j) which apply to all servers at position j, in each of the i groups. Moreover, a_(j)=q_(j) ^(T)*C. First consider retrieving one of the rows m that were not updated (but the R_(ij) nevertheless changed). Because the number of groups is even, and the rows m of the R_(ij) were either not modified at all (t_(m) was not set) or t_(m) was set and the value u had to be added to all rows, which cancel out each other because of the even group count, the value of a_(m) remains the same:

a _(m) ′=a _(m) when m≠b

Second, in the case where m is equal to b (index of the row that changed), the number of R_(ij)s to which u was added is odd: If the random vector r underlying t was not set at position b, an odd number of “special” R_(ij)s receive update u, by construction. If r was set at position b, because e_(b) reverses this, t_(b) is not set and an odd number of special R_(ij)s do not receive update u, which means that the number of R_(ij)s which receive update u is also odd as the number g of groups is even. Overall, when m equals b:

a _(b) ′=a _(b) +n*u (where count n is odd)

which means a_(j)′=a_(j)+u because of the XOR addition. Because u is the bitwise sum of v and w (i.e., u=v+w), and a_(j)=v (old value), this results in a_(j)′=v+u=v+(v+w)=w. The final result a=Σ_(j)a_(j) will also have value w because of the construction of the query vectors q_(j) which select exactly the value at position b.

The client secure storage module 124 further comprises a fully secure update module 220 that allows a client device 120 to update a portion of the data C, as stored collectively by the secure storage servers 101, to a new value, while preventing any of the servers 101 from determining which portion is being updated, and while additionally preventing any of the servers 101 from even determining an update delta value that is added to effect the transform of the row data to the desired new value. Specifically, the fully secure update module 220 sets the value of a particular row with index b to a given value (i.e., set of L bits) while concealing the value of b from the servers 101, and while also concealing the value of an update delta u from the servers, thus providing confidentiality guarantees for all stored items and update values at all times.

In one embodiment, the update delta u can be made confidential by doubling the amount of servers 101 in the system. To this end, the fully secure update module 220 stores C distributed across two sets of g*k servers, and sends different update messages to the two sets of g*k servers, where g is the number of groups and k the size of the groups.

Specifically, to initially store C across the two sets of g*k servers, two matrices C₁ and C₂ are created, such that the bitwise sum (C₁+C₂)=C; for example, C₁ could be C and C₂ could be the 0-matrix, or any other distribution of the bits of C across C₁ and C₂ such that C₁ and C₂ sum to C. C₁ is stored by the secure distribution module 205 across one of the two sets of g*k servers, and C₂ is stored across the other set of g*k servers. In order to update the row of C as thus stored, the fully secure update module 220 initializes a vector p of L random bits (L being the number of bits in a row of C). The fully secure update module 220 uses the secure update module 215 to update row bin one set of the g*k servers 101 with the value (p+v), and the other set of the g*k servers with the value (p+w) for row b. Thus, the row update values sent as part of the update are always combined with a randomp, so that the true row update values are not determinable by the processing servers. The added degree of security afforded by also concealing the update delta u may in some contexts be considered worth the doubling of servers that are used by the secure update module 215, in that this also prevents possible reverse-engineering of the original value v or updated value w based on value u.

When the client secure storage module requests the value of row b from the two sets of servers 101 via the secure read module 210 and then adding them up (with bitwise XOR), after the securely stored row b is updated by the fully secure updated module 220 to the value w, it will correctly receive w. Assuming that before the update the first set of the servers stored v₁ and the second set of the servers stored v₂ at the position of interest such that v₁+v₂=v, then updating will lead to the first set of the servers storing v₁+p+v and the second set of the servers storing v₂+p+w. Retrieving these two values and adding them up (with bitwise XOR) yields a=(v1+p+v)+(v₂+p+w)=v+v+p+p+w=w.

In one embodiment, the set of servers used to conceal the update value is at least doubled (in order to increase to effort necessary for servers 101 to collude). That is, if the secure update module 215 uses g*k servers 101 (where g is the number of server groups and k the size of each group), the fully secure update module 220 uses f*g*k servers, f>=2. The minimum configuration is 8 servers, since the secure update module 215 uses at least 4 servers (g=k=2).

The fully secure update module 220 performs two operations: The first operation is to initialize f−1 rows with random bits and one row with their sum such that when adding them all up results in a row of zeros; the second operation is to spread the bits of w and v over the f rows and adding them with XOR at the corresponding position. These f rows will be used to update each of the f sets independently. Because all these f rows will be summed up in the retrieval phase, the overall sum will be the old content of the f rows plus the value v+w, which is the update value u. In other words, all distribution of the update value to f rows is undone at the client device 120A. It is appreciated that there are many ways of distributing the bits of w and v: fully randomly, regularly (e.g. the first bit of w to row 1, second bit of w to row 2 etc. and restarting at row 1 after reaching the f+1 bit of w), or w fully in one row and v spread over all other rows, and the like.

The use of the fully secure update module 220, relative to the secure update module 215, additionally addresses the problem of preventing the value of the update delta from being determined, but uses double the number of servers 101. Alternatively, in some embodiments in which all the client devices 120 that access given data stored on the secure servers can obtain a shared key, the shared key is used to encrypt the update delta value so that the servers 101 cannot determine it. This avoids the need for doubling the number of servers 101 to provide the obfuscation of the update delta value via the common random vector p; for example, in one embodiment only the same number of servers 101 used by the secure update module 315 is required, plus a (possibly distinct) server to distribute a shared key to all the client devices 120 that are authorized to view the data in question. In these embodiments, the operation of the secure update module 215 is modified to encrypt the update value, w, using the key, resulting in the encrypted value w_(e). Since the row values are stored in encrypted form in this embodiment, the read of the current row value as performed by the secure read module 210 is v_(e), the encrypted form of the original value. The update messages sent to the servers then include, as the update delta value, the bitwise sum (XOR) of the encrypted versions of the old and new values—that is, u′ is the value included in the update messages sent to the servers, where u′=v_(e)+w_(e).

In an alternative embodiment of the fully secure update module 220, only the g*k servers of the secure update module 315 are used (instead of the f*g*k servers of the above-described embodiment), with per-row shared keys being stored in the g*k servers themselves without the need for additional key servers, and without the need for key distribution or storage of keys in the client devices 120. In this embodiment, the security depends on the quality of the encryption algorithm that uses the keys. More specifically, the content of each row is extended by two fields, s and r. In case of a symmetric encryption algorithm, the first field (s) serves as the seed for an encryption key, and the second field (r) is a pool of random bits. Initialization differs from the initialization of the g*k servers discussed above in that it prepares a wider content matrix C′ from of C as follows: For each row c of C, two fields of fixed width (i.e., s and r) are filled with random bits to which the encrypted form of the content row c is appended, i.e. s|r|enc(c), where “|” denotes appending, and enc(c) denotes the encrypted value of c. (It is appreciated that any other order of combining s, r, and enc(c) would also work, provided that a mechanism is available to separate the appended fields.) An encryption key is derived from the first field s, optionally also using (depending on the properties of the chosen encryption algorithm) a portion of the second field r. This key, together with the other portion of the second field (that can serve as initialization vector, for example), is used to encrypt the original data row c and this ciphertext enc(c) used in C′. The matrix C′ is then distributed to the g*k servers as before. Information retrieval is accomplished by securely retrieving an expanded row, extracting from it the key seed and the second field r, deriving from them the decryption key, and decrypting the bits that follow the two fields. Update is implemented by first securely retrieving the old content of the expanded row, assigning new random bits to the second field r′, encrypting the new data c_(new) and forming a new expanded row s|r′|enc′(c_(new)) as described for the initialization, and then updating the g*k servers with the XOR between the retrieved old expanded row and the new expanded row. Note that none of the g*k servers ever obtains the key used to encrypt the row's content, the key seed, the old data value, or the new data value. Rather, the servers only obtain the XOR differences of the ciphertexts and the (random) change of the second field r. The random bits r ensure that each update results in a different bit pattern (via new derived key and fresh initialization vector, for example). In one embodiment using AES and SHA256, for example, the first field (key seed) is 256 bits long, to which 128 bits from the second field are appended before hashing them, and this hash is used as key together with another 128 bits, also from the second field, as the initialization vector for this row.

FIGS. 3A-3D illustrate the interactions between a client device 120A and the various secure storage servers 101 as part of the various operations described above with respect to the modules of FIGS. 2A and 2B.

FIG. 3A illustrates the interactions between a client device 120A and the secure storage servers 101 as part of the secure distribution of the data C, according to one embodiment.

The secure distribution module 205 of the client device 120A produces 302 a set of K obfuscated portions R_(i) (e.g., N rows of L bits each) and sends 304 the obfuscated portions to the corresponding K secure storage servers 101. Each secure storage server S_(i) 101 stores its received obfuscated portion R in its obfuscated portion storage 255.

FIG. 3B illustrates the interactions between a client device 120A and the secure storage servers 101 as part of the secure data reading of a given row of data securely stored on the K servers 101, according to one embodiment.

The secure read module 210 of the client device 120A produces 312 a set of K query vectors q_(i), that collectively represent the row b whose value is desired, but with randomization such that no individual query vector reveals the identity of the row b. The secure read module 210 distributes 314 the query vectors to the corresponding secure storage servers S_(i) 101, as described above with respect to the secure read module 210.

Each server 101 computes a query result component a_(i), as described above with respect to the query vector application module 260, and provides 316 the a_(i) to the secure storage module 124 of the client device 120A.

The secure storage module 124 combines 318 the query result components a_(i) using a bitwise sum to derive the desired portion: v, the present value of the row b.

FIG. 3C illustrates the interactions between a client device 120A and the secure storage servers 101 as part of the secure update of a given row for g=2 groups of servers, according to one embodiment.

FIG. 3C assumes that the data C has already been distributed to the 2 k servers by the secure distribution module 205.

The secure storage module 124 of the client device 120A obtains 330 the current value, v, of the given row to be updated (b) using the secure read module 210 (which involves obtaining 329 the partial query result vectors as), as illustrated by FIG. 3B.

The secure storage module 124 computes 332 the update delta value, u, and a set of randomized components t, and generates 334 and sends different update messages containing <t, u> to the two halves of the 2 k servers, as described above with respect to the secure update module 215.

Each server S_(i) 101 that receives an update message uses its transformation module 565 to transform its current stored obfuscated portion of C, R_(j), using a mask based on the t and u values from the provided update message data. When taken across the set of servers 101 as a whole, this represents the updating of the desired row b to value w, without any given server 101 being able to determine which row b was updated due to the use of the randomized components t to obfuscate the row (though each server does at least know the update delta value u).

At step 338, in response to secure reading of the value of the row b by the client device 120A (as illustrated by FIG. 3B), the client device 120A obtains the value w by adding together the transformed partial query result vectors a_(i)′ obtained in step 337.

FIG. 3D illustrates the interactions between a client device 120A and the secure storage servers 101 as part of the fully secure update of a given row, according to one embodiment.

FIG. 3D assumes that the data C has already been distributed to the 4 k servers by the secure distribution module 205.

The secure storage module 124 of the client device 120A obtains 350 the current value, v, of the given row to be updated (b) using the secure read module 210, as illustrated by FIG. 3B. This involves obtaining 349 the partial query result vectors a_(i).

The secure storage module 124 computes 352 a first update value, u₁=(p+v), and computes 353 a second update value, u₂=(p+w), and then uses the secure update module 215 to update 356 the row b of half of the servers 101 with the first update value and to update 357 the row b of the other half of the servers with the second update value, as described above with respect to the secure update module 215. (That is, in terms of FIG. 3C, steps 332, 334, and 336 are performed for the two halves of the server set when implementing steps 356 and 357 of FIG. 3D, where the update delta u is the first update value (p+v) for one half, and the second update value (p+w) for the other half.) No server 101 in isolation can compute either the row b, or the new value w to which it is to be updated, from the messages specifying the updates.

As a consequence of the way in which the updating of steps 352-357 is performed, when the secure storage module 124 uses the secure read module 210 to obtain 360 the current value by querying the 4 k servers, it obtains the value w to which row b was securely updated.

It is appreciated that the particular order of operations described in FIGS. 3A-3D could be varied in different embodiments.

Example Uses

The use of the client secure storage module 124 and the secure storage servers 101 permit storage of client data on the servers (e.g., as cloud storage) in a manner that maintains privacy of the data, both with respect to the servers and to other parties, such as network eavesdroppers. The data stored may be of any type, such as messages, trade secrets (e.g., source code or business plans), images, and/or documents.

For example, a user wishing to share the source code for his computer program with other members of his team can securely store the code on the servers and make the credentials required to access it available to his team, such that his team can read and update the code, but none of the servers can determine the contents of the code, nor can a third party snooping on the network.

For another example, a family sharing its contacts in the cloud can use the service to retrieve and update the database without the servers being able to see which contact is looked up most frequently, which contacts recently changed their addresses and whom a contact represents.

For another example, social networking communication can be offered where the servers cannot deduce who has read the posts from whom and who added a comment to what message.

Example Operations for Secure Data Storage

FIG. 4 is a flow chart illustrating operations involved in distributing and updating a data item and reading the updated data item, according to one embodiment. The operations illustrated in FIG. 4 are performed by a source computer (e.g., the client devices 120 of FIG. 1), which can represent any computer system that uses the secure storage servers 101 to achieve secure data storage; this may include a computer system that includes server functionality of its own. Other embodiments may perform the steps in different orders and/or include additional or different steps.

In step 410, the source computer distributes a data item C to a plurality of secure storage servers 101, as discussed above with respect to the secure distribution module 205 of FIG. 2A and the operations of FIG. 3A. The data item C may be, for example, source code or another document containing a trade secret or other private or confidential information. The data item C is distributed to the servers 101 such that each of the plurality of servers stores some (that is, a proper subset of) the data of the data item, due to the way in which the bits of C are randomly distributed among the obfuscated portions R_(ij) of the different servers 101. Each of the servers 101 receives an obfuscated portion R_(ij) of same [N×L] number of bits as C, each obfuscated portion being initialized to random bits and including some of the bits of C imprinted into it.

In step 420, the source computer identifies a row of the data item—that is, a sub-portion of L bits of the data item—to be updated from a current value to a new value. For example, if the data item is a bitmap image securely stored on the servers 101 but read and edited locally on the source computer, and a user locally edits the bitmap image to change the colors of one of the pixels, and then indicates that the revised bitmap image should be securely updated, image editing software executing on the source computer could identify the changed pixel of the bit image, and correspondingly identify which row of the bitmap image data that pixel corresponds to.

In step 430, the source computer computes an update delta value for the row based on the current value of the row (which includes the bits encoding the color value of the pixel stored before the pixel color was changed) and the new value of the row (which includes the bits encoding the color value of the pixel after the pixel color was changed). For example, the update delta value can be the bitwise sum of the current and new values of the row.

In step 440, the source computer distributes update messages to the plurality of servers that cause the servers collectively to update the value of the row from the current value to the new value by updating their corresponding stored obfuscated portions R_(ij), as described above with respect to the secure update module 215 and the operations of FIG. 3C. This includes the forming of the messages m=<t_(i),u>, where the t_(i) values introduce random bits that obfuscate the identity of the row being updated, such that the row is not derivable from any given one of the update messages, and hence is not known to any given one of the servers 101 that receives a given one of the update messages or to eavesdroppers on the network 140 that obtain one of the update messages. Rather, the application of the mask generated from the outer product of t_(i) and u, when performed by all of the involved servers 101, collectively causes the update of the row in question.

In step 450, after the update of step 440, the source computer (or another source computer that is authorized to read the data item) requests the updated value of the row. For example, the source computer may re-load the file for the data item at some later time and request the updated value of the row (and of the other rows of the data item) from the servers 101. To obtain the updated value of the row, the source computer generates and distributes a plurality of query vectors to the servers 101, as described above with respect to the secure read module 210 and the operations of FIG. 3B. The query vectors collectively identify the row to be read such that the row is not derivable from any given one of the query vectors, due to the initialization of the query vectors to random bits so as to obfuscate the row ID that is imprinted on one of (or, more generally, an odd number of) the query vectors.

In step 460, the source computer determines the new (updated) value of the row in question using the partial query result vectors a_(ij) that the servers 101 send back in response to receiving the query vectors, as described above with respect to the secure read module 210 and the operations of FIG. 3B.

Example Computer Architecture

FIG. 5 is a high-level block diagram illustrating physical components of a computer 500 used as part or all of the secure storage servers 101 or client devices 120 from FIG. 1, according to one embodiment. Illustrated are at least one processor 502 coupled to a chipset 504. Also coupled to the chipset 504 are a memory 506, a storage device 508, a keyboard 510, a graphics adapter 512, a pointing device 514, and a network adapter 516. A display 518 is coupled to the graphics adapter 512. In one embodiment, the functionality of the chipset 504 is provided by a memory controller hub 520 and an I/O controller hub 522. In another embodiment, the memory 506 is coupled directly to the processor 502 instead of the chipset 504.

The storage device 508 is any non-transitory computer-readable storage medium, such as a hard drive, compact disk read-only memory (CD-ROM), DVD (Digital Versatile Disc), or a solid-state memory device. The memory 506 holds instructions and data used by the processor 502. The pointing device 514 may be a mouse, track ball, or other type of pointing device, and is used in combination with the keyboard 510 to input data into the computer 500. The graphics adapter 512 displays images and other information on the display 518. The network adapter 516 couples the computer 500 to a local or wide area network.

As is known in the art, a computer 500 can have different and/or other components than those shown in FIG. 5. In addition, the computer 500 can lack certain illustrated components. In one embodiment, a computer 500 acting as a server may lack a keyboard 510, pointing device 514, graphics adapter 512, and/or display 518. Moreover, the storage device 508 can be local and/or remote from the computer 500 (such as embodied within a storage area network (SAN)).

As is known in the art, the computer 500 is adapted to execute computer program modules for providing functionality described herein. As used herein, the term “module” refers to computer program logic utilized to provide the specified functionality. Thus, a module can be implemented in hardware, firmware, and/or software. In one embodiment, program modules are stored on the storage device 508, loaded into the memory 506, and executed by the processor 502.

Other Considerations

Reference in the specification to “one embodiment” or to “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiments is included in at least one embodiment. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.

It should be noted that the process steps and instructions are embodied in software, firmware or hardware, and when embodied in software, can be downloaded to reside on and be operated from different platforms used by a variety of operating systems.

The operations herein may also be performed by an apparatus. Furthermore, the computers referred to in the specification may include a single processor or may be architectures employing multiple processor designs for increased computing capability. It will be appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any references below to specific languages are provided for disclosure of enablement and best mode of the present invention.

While the invention has been particularly shown and described with reference to a preferred embodiment and several alternate embodiments, it will be understood by persons skilled in the relevant art that various changes in form and details can be made therein without departing from the spirit and scope of the invention.

Finally, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, the disclosure of the present invention is intended to be illustrative, but not limiting, of the scope of the invention, which is set forth in the following claims. 

1-20. (canceled)
 21. A computer-implemented method comprising: initializing a plurality of obfuscated portions to random bit values such that a sum of two of the plurality of obfuscated portions is zero; distributing bits of a data item among the plurality of obfuscated portions, wherein each of the plurality of obfuscated portions includes a subset of content of the data item, wherein the data item and the plurality of obfuscated portions comprise bit matrices in which each matrix element is a bit; and distributing the obfuscated portions from a source computer to a plurality of servers, wherein each of the servers stores a respective obfuscated portion from the plurality of obfuscated portions.
 22. The method of claim 21, wherein the data item and the plurality of obfuscated portions comprise bit matrices of equal size.
 23. The method of claim 21, further comprising: distributing to the servers a plurality of query vectors in which each vector element is a bit, the query vectors collectively identifying a sub-portion of the data item, wherein the sub-portion is not derivable from any given one of the query vectors, and wherein distributing the plurality of query vectors comprises sending to each server from the plurality of servers a respective query vector from the plurality of query vectors; and determining a value of the sub-portion using a plurality of query result vectors received from the plurality of servers in response to the plurality of query vectors, wherein determining the new value comprises combining the plurality of query result vectors.
 24. The method of claim 23, wherein the sub-portion is a row of the data item.
 25. The method of claim 23, wherein each query vector comprises one element for each row of the data item.
 26. The method of claim 23, wherein each query result vector in the plurality of query result vectors comprises a matrix-vector product of (i) a query vector from the plurality of query vectors and (ii) an obfuscated portion from the plurality of obfuscated portions.
 27. The method of claim 23, wherein determining the value of the sub-portion comprises computing a bitwise sum of the query result vectors.
 28. The method of claim 21, further comprising: identifying a row of the data item to update from a current value to a new value; computing an update delta value for the row of the data item based on the current value and the new value; and distributing update messages based on the update delta value to the plurality of servers, the update messages causing the plurality of servers to update the corresponding plurality of obfuscated portions stored by the servers using the update delta value so as to update the current value of the row from the current value to the new value, the update messages collectively indicating the row to update such that the row is not derivable from any given one of the update messages.
 29. The method of claim 28, wherein distributing update messages based on the update delta value comprises: for each server from the plurality of servers: generating a randomized component; generating an update message comprising the randomized component and the update delta value; and sending the generated update message to the server.
 30. The method of claim 29, wherein the randomized component is either a vector of random bits, or a combination of a vector of random bits with a vector representing a row index of the row.
 31. A system comprising: one or more computer processors programmed to perform operations comprising: initializing a plurality of obfuscated portions to random bit values such that a sum of two of the plurality of obfuscated portions is zero; distributing bits of a data item among the plurality of obfuscated portions, wherein each of the plurality of obfuscated portions includes a subset of content of the data item, wherein the data item and the plurality of obfuscated portions comprise bit matrices in which each matrix element is a bit; and distributing the obfuscated portions from a source computer to a plurality of servers, wherein each of the servers stores a respective obfuscated portion from the plurality of obfuscated portions.
 32. The system of claim 31, wherein the data item and the plurality of obfuscated portions comprise bit matrices of equal size.
 33. The system of claim 31, the operations further comprising: distributing to the servers a plurality of query vectors in which each vector element is a bit, the query vectors collectively identifying a sub-portion of the data item, wherein the sub-portion is not derivable from any given one of the query vectors, and wherein distributing the plurality of query vectors comprises sending to each server from the plurality of servers a respective query vector from the plurality of query vectors; and determining a value of the sub-portion using a plurality of query result vectors received from the plurality of servers in response to the plurality of query vectors, wherein determining the new value comprises combining the plurality of query result vectors.
 34. The system of claim 33, wherein the sub-portion is a row of the data item.
 35. The system of claim 33, wherein each query vector comprises one element for each row of the data item.
 36. The system of claim 33, wherein each query result vector in the plurality of query result vectors comprises a matrix-vector product of (i) a query vector from the plurality of query vectors and (ii) an obfuscated portion from the plurality of obfuscated portions.
 37. The system of claim 33, wherein determining the value of the sub-portion comprises computing a bitwise sum of the query result vectors.
 38. The system of claim 31, the operations further comprising: identifying a row of the data item to update from a current value to a new value; computing an update delta value for the row of the data item based on the current value and the new value; and distributing update messages based on the update delta value to the plurality of servers, the update messages causing the plurality of servers to update the corresponding plurality of obfuscated portions stored by the servers using the update delta value so as to update the current value of the row from the current value to the new value, the update messages collectively indicating the row to update such that the row is not derivable from any given one of the update messages.
 39. The system of claim 38, wherein distributing update messages based on the update delta value comprises: for each server from the plurality of servers: generating a randomized component; generating an update message comprising the randomized component and the update delta value; and sending the generated update message to the server.
 40. A storage device comprising: a non-transitory, computer-readable storage medium storing instructions that when executed by one or more computer processors perform actions comprising: initializing a plurality of obfuscated portions to random bit values such that a sum of two of the plurality of obfuscated portions is zero; distributing bits of a data item among the plurality of obfuscated portions, wherein each of the plurality of obfuscated portions includes a subset of content of the data item, wherein the data item and the plurality of obfuscated portions comprise bit matrices in which each matrix element is a bit; and distributing the obfuscated portions from a source computer to a plurality of servers, wherein each of the servers stores a respective obfuscated portion from the plurality of obfuscated portions. 